#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define LL long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int INF = 1 << 30;
const ldb pi = fabsl(atan2(0.0, -1.0));
using namespace std;


int n, m, k, t;
vector <int > all;

void Load()
{
	cin >> n >> m >> k >> t;
	int a, b;
	int i;
	for (i = 0; i < k; i++)
	{
		cin >> a >> b;
		a--, b--;
		all.push_back(a * m + b);
	}
	sort(all.begin(), all.end());
}

int find(int key)
{
	int l = 0;
	int r = all.size() - 1;
	int mid;
	int res = -1;
	while (l <= r)
	{
		mid = (l + r) / 2;
		if (all[mid] <= key)
		{
			res = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	return res;
}

void Solve()
{
	int i;
	int a, b;
	int c;
	for (i = 0; i < t; i++)
	{
		cin >> a >> b;
		a--, b--;
		c = find(a * m + b);
		if (c >= 0 && all[c] == a * m + b)
		{
			cout << "Waste\n";
			continue;
		}
		c++;
		if ((a * m + b - c) % 3 == 0)
		{
			cout << "Carrots\n";
		}
		else if ((a * m + b - c) % 3 == 1)
		{
			cout << "Kiwis\n";
		}
		else 
		{
			cout << "Grapes\n";
		}
	}
}

#define file "b"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}
